Перевод: со всех языков на все языки

со всех языков на все языки

convex cover

См. также в других словарях:

  • convex hull — Math. the smallest convex set containing a given set; the intersection of all convex sets that contain a given set. Also called convex cover, convex span. * * * …   Universalium

  • convex hull — Math. the smallest convex set containing a given set; the intersection of all convex sets that contain a given set. Also called convex cover, convex span …   Useful english dictionary

  • Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? …   Wikipedia

  • List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… …   Wikipedia

  • watch crystal — cover that protects the face of a watch; concavo convex glass that covers and protects the face of a watch …   English contemporary dictionary

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

  • Molding (decorative) — For other uses, see Molding (disambiguation). Cavetto molding and resulting shadow pattern Ovolo molding and resulting shadow pattern …   Wikipedia

  • Cartan–Hadamard theorem — The Cartan–Hadamard theorem is a statement in Riemannian geometry concerning the structure of complete Riemannian manifolds of non positive sectional curvature. The theorem states that the universal cover of such a manifold is diffeomorphic to a… …   Wikipedia

  • Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… …   Wikipedia

  • Convexity in economics — Economics …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»